Convex analysis of minimal time and signed minimal time functions
نویسندگان
چکیده
In this paper, we first consider the class of minimal time functions in general setting locally convex topological vector (LCTV) spaces. The results obtained framework are based on a novel notion closedness target sets with respect to constant dynamics. Then, introduce and investigate new signed functions, which generalizations distance functions. Subdifferential formulas for under convexity assumptions given data.
منابع مشابه
Convex Sets and Minimal Sublinear Functions
We show that, given a closed convex set K with the origin in its interior, the support function of the set {y ∈ K∗ | ∃x ∈ K such that xy = 1} is the pointwise smallest sublinear function σ such that K = {x |σ(x) ≤ 1}.
متن کاملProximal Analysis and the Minimal Time Function∗
Under general hypotheses on the target set S and the dynamics of the system, we show that the minimal time function TS(·) is a proximal solution to the Hamilton–Jacobi equation. Uniqueness results are obtained with two different kinds of boundary conditions. A new propagation result is proven, and as an application, we give necessary and sufficient conditions for TS(·) to be Lipschitz continuou...
متن کاملGossiping in Minimal Time
The gossip problem involves communicating a unique item from each node in a graph to every other node. We study the minimum time required to do this under the weakest model of parallel communication which allows each node to participate in just one communication at a time as either sender or receiver. We study a number of topologies including the complete graph, grids, hypercubes and rings. Dee...
متن کاملON MINIMAL PARABOLIC FUNCTIONS AND TIME-HOMOGENEOUS PARABOLIC h-TRANSFORMS
Does a minimal harmonic function h remain minimal when it is viewed as a parabolic function? The question is answered for a class of long thin semi-infinite tubes D ⊂ R of variable width and minimal harmonic functions h corresponding to the boundary point of D “at infinity.” Suppose f(u) is the width of the tube u units away from its endpoint and f is a Lipschitz function. The answer to the que...
متن کاملthe common minimal dominating signed graph
in this paper, we define the common minimal dominating signed graph of a given signed graph and offer a structural characterization of common minimal dominating signed graphs. in the sequel, we also obtained switching equivalence characterizations: $overline{s} sim cmd(s)$ and $cmd(s) sim n(s)$, where $overline{s}$, $cmd(s)$ and $n(s)$ are complementary signed gra...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Optimization
سال: 2021
ISSN: ['0974-0988']
DOI: https://doi.org/10.1080/02331934.2021.1910695